UCAV编队对地攻击智能决策系统总体结构

UCAV编队对地攻击是未来战争制信息权和制空权的关键所在,结合无人作战飞机(UCAV)与有人驾驶飞机各自的特点和优势,提出了UCAV编队对地攻击系统的基本组成和对地攻击流程.根据UCAV编队对地攻击的战术决策类型和决策方式,构造了UCAV编队对地攻击智能决策系统的总体结构并且提出了决策系统应该解决的关键技术,详细分析了所建立的UCAV编队对地攻击决策系统的决策方式和决策流程,并且对该系统所涉及的关键技术进行了详细的研究.     

基于模糊动态层次分析法的军车全寿命费用模型

为研究军车最优的效费比，提出了控制军车装备费用增长的有效途径——全寿命费用管理方法，并通过模糊动态层次分析法建立了分析决策模型，将定性与定量的分析有机结合起来研究军车全寿命费用的变化趋势，有利于提高军车装备的可靠性和决策的科学性，具有较好的应用价值。     

模块结构EMS 型磁浮列车的导向控制研究

本文研究了模块结构ＥＭＳ型磁浮列车中的一对相互错开的电磁铁的导向模型,采用衰减记忆算法实施导向控制,通过仿真比较了主动控制系统与自稳定系统的导向效果,讨论了导向控制对纵向悬浮的影响     

装甲车辆运用工程学科理论体系

本文论述了装甲车辆运用工程学科建立的社会历史背景和理论基础、学科的任务与研究内容,介绍了对学科理论体系研究的成果:归纳理顺了学科理论体系的结构,对各相应层次的知识单元给以定义、编码和内容要点说明,并编制了计算机应用软件,具有检索查询、显示、打印、维护功能,从而大大方便了使用.     

军方在装甲车辆保障性分析中的前期工作

论述了军方在装甲车辆保障性分析中前期应作的主要工作,合理地提出了装甲车辆的保障性指标;参与装甲车辆方案权衡,优化系统设计方案.     

装甲车辆使用可靠性综合评定方法

基于使用可靠性的特点,介绍了装甲车辆使用可靠性综合评定模型的建立过程、参数、权重、目标值等的有关计算,运用该模型可对装甲车辆使用过程中的可性工作进行评价、指导.     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011